Review on a Dynamic Scheduling Algorithm for Grid with Task Duplication

Scheduling of tasks in the grid environment is challenging compared to that in local computing service facilities. In the field of distributed and parallel computing grid computing plays a vital role for solving a wide range of large scale parallel applications. The main goal of task scheduling is to achieve high system throughput and to match the application with the available computing resources. Schedulers are responsible for the management of jobs. These schedulers then form a hierarchical structure, with meta-schedulers that form the root and other lower level schedulers, while providing specific scheduling capabilities. Grid scheduling systems operate in dynamic environments subject to various unforeseen and unplanned events. Such events include the breakdown of computers, arrival of new jobs; processing times are subject to stochastic variations, etc. The objective of the paper is to develop a scheduling strategy using task duplication which improves the performance by duplicating the tasks and then refine them. With some threshold the above mentioned event happens in dynamic environment.